A B C D E F G H I J K L M N O P Q R S T U V W
All Classes All Packages
All Classes All Packages
All Classes All Packages
B
- badElementIndex(int, int, String) - Static method in class edu.claflin.finder.algo.jungutils.Preconditions
- badPositionIndex(int, int, String) - Static method in class edu.claflin.finder.algo.jungutils.Preconditions
- badPositionIndexes(int, int, int) - Static method in class edu.claflin.finder.algo.jungutils.Preconditions
- BatchProcessor<T,S> - Class in edu.claflin.finder.logic.processor
-
Used to process one or multiple objects.
- BatchProcessor() - Constructor for class edu.claflin.finder.logic.processor.BatchProcessor
-
Constructs a BatchProcessor.
- BetweennessCentrality<V,E> - Class in edu.claflin.finder.algo.jungutils
-
Computes betweenness centrality for each vertex and edge in the graph.
- BetweennessCentrality(Graph<V, E>) - Constructor for class edu.claflin.finder.algo.jungutils.BetweennessCentrality
-
Calculates betweenness scores based on the all-pairs unweighted shortest paths in the graph.
- BetweennessCentrality(Graph<V, E>, Function<? super E, ? extends Number>) - Constructor for class edu.claflin.finder.algo.jungutils.BetweennessCentrality
-
Calculates betweenness scores based on the all-pairs weighted shortest paths in the graph.
- BetweennessCentrality.BetweennessComparator - Class in edu.claflin.finder.algo.jungutils
- BetweennessCentrality.BetweennessData - Class in edu.claflin.finder.algo.jungutils
- BetweennessComparator() - Constructor for class edu.claflin.finder.algo.jungutils.BetweennessCentrality.BetweennessComparator
- BetweennessData() - Constructor for class edu.claflin.finder.algo.jungutils.BetweennessCentrality.BetweennessData
- BFS(Map) - Method in class edu.claflin.finder.logic.cygrouper.CytogrouperMain
- BinarySearchTree<T extends TreeNodeInfo> - Class in edu.claflin.finder.logic.communities.struct
- BinarySearchTree() - Constructor for class edu.claflin.finder.logic.communities.struct.BinarySearchTree
-
Create an empty BinarySearchTree.
- BinarySearchTree(boolean) - Constructor for class edu.claflin.finder.logic.communities.struct.BinarySearchTree
- bipartite - Variable in class edu.claflin.finder.algo.BronKerbosch
- BipartiteCondition - Class in edu.claflin.finder.logic.cond
-
Represents a bipartite graph as a Condition object.
- BipartiteCondition() - Constructor for class edu.claflin.finder.logic.cond.BipartiteCondition
- bipartiteDivision(Graph) - Static method in class edu.claflin.finder.logic.BronKerboschBipartiteUtils
-
Divides the given graph into bipartite sets.
- booleanList - Variable in class edu.claflin.finder.algo.ArgumentsBundle
-
The Mapping of String keywords to Notable Boolean values.
- BreadthFirstTraversalSearch - Class in edu.claflin.finder.algo
-
Processes a
Graphsearching for subgraphs by performing a breadth first search on each node of the graph. - BreadthFirstTraversalSearch(ArgumentsBundle) - Constructor for class edu.claflin.finder.algo.BreadthFirstTraversalSearch
-
Public constructor for initializing the BreadthFirstTraversalSearch with default conditions.
- bronKerbosch(ArrayList<Graph>, Graph, Graph, Graph, Graph) - Static method in class edu.claflin.finder.algo.BronKerbosch
-
Recursive helper method to do the above.
- BronKerbosch - Class in edu.claflin.finder.algo
-
Finds Maximum Cliques and Bicliques with Bron Kersboch Algorithm.
- BronKerbosch(ArgumentsBundle) - Constructor for class edu.claflin.finder.algo.BronKerbosch
-
Public constructor for initializing the Bron Kersbboch with default conditions.
- bronKerboschBiclique(Graph) - Static method in class edu.claflin.finder.algo.BronKerbosch
-
Bipartite Bron Kerbosch algorithm that uses the above to find all complete bipartite graphs within a bipartite graph.
- BronKerboschBipartiteUtils - Class in edu.claflin.finder.logic
-
Provides methods to mark graphs as bipartite using the basic Graph, Edge, and Node classes.
- BronKerboschBipartiteUtils() - Constructor for class edu.claflin.finder.logic.BronKerboschBipartiteUtils
- bronKerboschClique(Graph) - Static method in class edu.claflin.finder.algo.BronKerbosch
-
Given a graph, finds all complete subgraphs.
- buildCommunityGraphs(List<List<Node>>, Graph) - Method in class edu.claflin.finder.algo.clustering.ClusteringAlgorithm
- Bundle - Class in edu.claflin.finder.algo
-
Processes a
Graphsearching for subgraphs. - Bundle(Algorithm[]) - Constructor for class edu.claflin.finder.algo.Bundle
-
Constructs the Algorithm object.
- bW - Variable in class edu.claflin.finder.log.LogUtil
-
The BufferedWriter used to log to a file.
All Classes All Packages